- canonical sentential form
- 规范句型
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
canonical sentential form
Look at other dictionaries:
True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
logic — logicless, adj. /loj ik/, n. 1. the science that investigates the principles governing correct or reliable inference. 2. a particular method of reasoning or argumentation: We were unable to follow his logic. 3. the system or principles of… … Universalium
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
History of linguistics — Linguistics as a study endeavors to describe and explain the human faculty of language.Historically, linguistic study was motivated by the correct description of a liturgical language, notably that of Sanskrit grammar by IAST|Pāṇini (fl. 4th… … Wikipedia
Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… … Wikipedia
Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only … Wikipedia
Conversation analysis — (commonly abbreviated as CA) is the study of talk in interaction (both verbal and non verbal in situations of everyday life). CA generally attempts to describe the orderliness, structure and sequential patterns of interaction, whether… … Wikipedia
Joseph Hilbe — Infobox Scientist name = Joseph Hilbe |PD self caption = Joseph Hilbe birth date = Birth date and age|1944|12|30|mf=y birth place = Los Angeles, California, United States death date = place death = field = statistician, mathematician, and… … Wikipedia
Alfred Tarski — Infobox scientist name = Alfred Tarski caption = birth date = birth date|1901|01|14 birth place = Warsaw, Poland (under Russian rule at the time) death date = death date|1983|10|26 death place = Berkeley, California fields = Mathematics, logic,… … Wikipedia
